On Drawing Planar Angle Graphs

Recently, some advanced algorithms for straight line drawings of planar graphs have been introduced. However, these algorithms produce drawings with many small angles. Their drawings are not aesthetically nice. Our goal is to resolve these problems by a beautifier. We consider the angles of planar straight line drawings. In a first phase we compute maximal angles by repeatedly solving a linear program. In a second phase we construct planar straight line drawings satisfying these angles. However, the drawability is not guaranteed. There are two approaches, either by a linear program for the edge length or by a new spring embedder. In our experiments we have achieved very promising results. On our test data, these algorithms outperform other advanced algorithms for straight line drawings and resolve the problem of drawings with too many small angles.